Optimal Source Coding Rate for Limited Buffer Size
نویسندگان
چکیده
We consider the problem of choosing the optimal rate control for a source coder when transmitting lossy-compressed data in real-time over a channel with time-varying rate. Optimality is in the sense of minimizing average distortion. The real-time constraint is formulated as a limited buffer size. Our result is that optimal rate should be piecewise constant and only change when buffer is full or empty. This holds in general for a wide variety of rate-distortion functions, as long as they satisfy some reasonable constraints.
منابع مشابه
Delay-Distortion-Power Trade Offs in Quasi-Stationary Source Transmission over Block Fading Channels
This paper investigates delay-distortion-power trade offs in transmission of quasi-stationary sources over block fading channels by studying encoder and decoder buffering techniques to smooth out the source and channel variations. Four source and channel coding schemes that consider buffer and power constraints are presented to minimize the reconstructed source distortion. The first one is a hi...
متن کاملQuality Control for VBR Video over ATM Networks
Uncontrolled variable-bit-rate (VBR) coded video yields consistent picture quality, but the traffic stream is very bursty. When sent over ATM networks, cell losses may be incurred due to limited buffer capacity at the switches; this could cause severe picture quality degradation. Source rate control can be implemented to generate a controlled VBR bit stream which conforms to specified bit rate ...
متن کاملOptimal buffered compression and coding mode selection for MPEG-4 shape coding
We propose an optimal buffered compression algorithm for shape coding as defined in the forthcoming MPEG-4 international standard. The MPEG-4 shape coding scheme consists of two steps: first, distortion is introduced by down and up scaling; then, context-based arithmetic encoding is applied. Since arithmetic coding is "lossless," the down up scaling step is considered as a virtual quantizer. We...
متن کاملOptimal sub-graph selection over coded networks with delay and limited-size buffering the authors consider
The authors consider the problem of finding a minimum cost multicast sub-graph based on network coding, where delay values associated with each link, limited buffer-size of the intermediate nodes and link capacity variations over time are taken into account. The authors consider static multicast (where membership of the multicast group remains constant for the duration of the connection) in los...
متن کاملOn Two-Echelon Multi-Server Queue with Balking and Limited Intermediate Buffer
In this paper we study two echelon multi-server tandom queueing systems where customers arrive according to a poisson process with two different rates. The service rates at both echelons are independent of each other. The service times of customers is assumed to be completed in two stages. The service times at each stage are exponentially distributed. At the first stage, the customers may balk ...
متن کامل